Number of Forts in Iterated Logistic Mapping
نویسندگان
چکیده
منابع مشابه
Landslide susceptibility mapping using logistic regression analysis in Latyan catchment
Every year, hundreds of people all over the world lose their lives due to landslides. Landslide susceptibility map describes the likelihood or possibility of new landslides occurring in an area, and therefore helping to reduce future potential damages. The main purpose of this study is to provide landslide susceptibility map using logistic regression model at Latyan watershed, north Iran. I...
متن کاملIndependence number of iterated line digraphs
In this paper, we deal with the independence number of iterated line digraphs of a regular digraph G. We give pertinent lower bounds and give an asymptotic estimation of the ratio of the number of vertices of a largest independent set of the nth iterated line digraph of G. © 2005 Elsevier B.V. All rights reserved.
متن کاملThe Logistic Lattice in Random Number Generation
This paper describes pseudo-random number generators based on non-linear dynamics. The recommended generator uses a special “re-mapped” form of the logistic equation at each of a finite set of nodes arranged in a 1or 2-dimensional ring. Each node receives small perturbations from adjacent nodes by means of diffusive coupling equations the so-called coupled map lattice. The generator is notable ...
متن کاملThe Iterated Lasso for High-Dimensional Logistic Regression
We consider an iterated Lasso approach for variable selection and estimation in sparse, high-dimensional logistic regression models. In this approach, we use the Lasso (Tibshirani 1996) to obtain an initial estimator and reduce the dimension of the model. We then use the Lasso as the initial estimator in the adaptive Lasso (Zou 2006) to obtain the final selection and estimation results. We prov...
متن کاملCircular chromatic number for iterated Mycielski graphs
For a graph G, let M(G) denote the Mycielski graph of G. The t-th iterated Mycielski graph of G, M(G), is defined recursively by M0(G) = G and M(G)= M(Mt−1(G)) for t ≥ 1. Let χc(G) denote the circular chromatic number of G. We prove two main results: 1) Assume G has a universal vertex x, then χc(M(G)) = χ(M(G)) if χc(G − x) > χ(G − x) − 1/2 and G is not a star, otherwise χc(M(G)) = χ(M(G)) − 1/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2016
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2016/4682168